A hybrid constraint programming and enumeration approach for solving NHL playoff qualification and elimination problems
نویسندگان
چکیده
منابع مشابه
A hybrid constraint programming and enumeration approach for solving NHL playoff qualification and elimination problems
Many sports fans invest a great deal of time into watching and analyzing the performance of their favorite team. However, the tools at their disposal are primarily heuristic or based on folk wisdom. We provide a concrete mechanism for calculating the minimum number of points needed to guarantee a playoff spot and the minimum number of points needed to possibly qualify for a playoff spot in the ...
متن کاملClinching and Elimination of Playoff Berth in the NHL
We consider the problem of determining as early as possible when teams in the NHL are mathematically qualified or eliminated from the playoffs. We describe the rules outlined by the NHL and give a mixed integer program formulation to determine mathematical qualification and elimination. We also give a slightly simplified version of the MIP that is more computationally tractable and computationa...
متن کاملA NEW APPROACH FOR SOLVING FULLY FUZZY QUADRATIC PROGRAMMING PROBLEMS
Quadratic programming (QP) is an optimization problem wherein one minimizes (or maximizes) a quadratic function of a finite number of decision variable subject to a finite number of linear inequality and/ or equality constraints. In this paper, a quadratic programming problem (FFQP) is considered in which all cost coefficients, constraints coefficients, and right hand side are characterized by ...
متن کاملLessons Learned from Modelling the NHL Playoff Qualification Problem
The modelling of complex problems tends to be most effective when modelling is calibrated using a concrete solver and modifications to the model are made as a result. In some cases, the final model is significantly different from the simple model that best fits the constraints of the problem. While there are several projects that are attempting to create black box solvers with generic modelling...
متن کاملA dynamic programming approach for solving nonlinear knapsack problems
Nonlinear Knapsack Problems (NKP) are the alternative formulation for the multiple-choice knapsack problems. A powerful approach for solving NKP is dynamic programming which may obtain the global op-timal solution even in the case of discrete solution space for these problems. Despite the power of this solu-tion approach, it computationally performs very slowly when the solution space of the pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2012
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2011.11.045